Linear embedding of binary hierarchies and its applications

نویسنده

  • Boris G. Mirkin
چکیده

The discrete binary hierarchy (DBH) is a concept underlyingmany important issues in analysis of complex systems: knowledge structures, testand-search organization, evolutionary trees, taxonomy, data handling, etc. It appears that any DBH corresponds to an orthonormal basis of the Euclidean space related to the hierarchy leaves. The properties of these bases form a mathematical framework which can be applied to such problems as clustering and multiresolution image/signal processing. Clustering applications are based on a DBH-based analogue of the singular-value-decomposition of data matrices. A theoretical support for a method in divisive clustering is provided along with some decomposition-based interpretation aids. Data processing applications appear parallel to those involving the concepts of wavelets and quadtrees. However, DBH-based techniques seem to offer some potential improvements based on relaxing “continuity and homogeneity” restrictions of classical theories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The embedding method to obtain the solution of fuzzy linear systems

In this paper, we investigate the general fuzzy linear system of equations.  The  main aim of this paper is based on the embedding approach. We find the necessary and sufficient conditions for the existence of fuzzy solution of the mentioned systems.  Finally, Numerical examples are presented to more illustration of the proposed model.

متن کامل

Well-partial-orderings and hierarchies of binary trees

The set of binary trees together with the homeomorphic embedding build an wellpartial-ordering. It is well known that its maximal order type is ε0 as shown by de Jongh and that its canonical linearization is the system obtained from the celebrated Feferman-Schütte system for Γ0 by omitting the addition operator. We show here that Higman’s Lemma and Dershowitz’s recursive path ordering are nice ...

متن کامل

A top-down method for building genome classification trees with linear binary hierarchies

With complete genome sequence data becoming available at an increasing rate, the problem of classification of the genomes on the basis of different criteria is becoming pressing. Here we present an approach that applies linear embedding of binary hierarchies to the analysis of the representation of genomes in clusters of orthologs. Rather than imposing an evolutionary postulate such as the addi...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996